A bankruptcy problem and an information trading problem: Applications tok-convex games

نویسنده

  • Theo S. H. Driessen
چکیده

The paper is devoted to two real problems that generate a cooperative game model with a so-called k-convex characteristic function when certain conditions are fulfilled. Both a bankruptcy problem and an information trading problem are modelled as a cooperative game by constructing the corresponding bankruptcy game as well as the information market game. Firstly, it is established that the bankruptcy game is a k-convex n-person game where 1 < k < n 2 if and only if the estate is sufficient to meet the claims of creditors in any (n k)-person coalition. Secondly, it is shown that the k-convexity property for the information market game is equivalent to the nonexistence of profits with respect to a restricted class of submarkets.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bankruptcy Assessment with the Interval Programming and Games Theory

Some of the parameters in issues of the reality world are uncertainty. One of the uncertain problems with the qualitative parameters is economic problems such as bankruptcy problem. In this case, there is a probability of dealing with imprecise concepts including the intervals regarding the official’s viewpoint, organizations’ managers. Accordingly, this article uses the concepts of data envelo...

متن کامل

Obtaining a possible allocation in the bankruptcy model using the Shapley value

Data envelopment analysis (DEA) is an effective tool for supporting decision-makers to assess bankruptcy, uncertainty concepts including intervals, and game theory. The bankruptcy problem with the qualitative parameters is an economic problem under uncertainty. Accordingly, we combine the concepts of the DEA game theory and uncertain models as interval linear programming (ILP), which can be app...

متن کامل

Modified Convex Data Clustering Algorithm Based on Alternating Direction Method of Multipliers

Knowing the fact that the main weakness of the most standard methods including k-means and hierarchical data clustering is their sensitivity to initialization and trapping to local minima, this paper proposes a modification of convex data clustering  in which there is no need to  be peculiar about how to select initial values. Due to properly converting the task of optimization to an equivalent...

متن کامل

Optimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions

In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...

متن کامل

The KKT optimality conditions for constrained programming problem with generalized convex fuzzy mappings

The aim of present paper is to study a constrained programming with generalized $alpha-$univex fuzzy mappings. In this paper we introduce the concepts of $alpha-$univex, $alpha-$preunivex, pseudo $alpha-$univex and $alpha-$unicave fuzzy mappings, and we discover that $alpha-$univex fuzzy mappings are more general than univex fuzzy mappings. Then, we discuss the relationships of generalized $alp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Meth. of OR

دوره 41  شماره 

صفحات  -

تاریخ انتشار 1995